Analysis of algorithms

Results: 1454



#Item
41A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin

A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2014-11-26 08:31:39
42MSGIC Executive Committee Meeting Minutes January 8, 2016 9a.m. – 12p.m. Anne Arundel County Government, Heritage Complex (Annapolis, MD) Attendees:

MSGIC Executive Committee Meeting Minutes January 8, 2016 9a.m. – 12p.m. Anne Arundel County Government, Heritage Complex (Annapolis, MD) Attendees:

Add to Reading List

Source URL: msgic.org

Language: English - Date: 2016-04-09 16:41:29
43Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair

Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21
44SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted

SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2013-03-13 08:17:47
45Algorithms and Data Structures Winter TermExercises for UnitShow that the price of anarchy for routing games with quadratic latency functions `e (x) = x2 is at most

Algorithms and Data Structures Winter TermExercises for UnitShow that the price of anarchy for routing games with quadratic latency functions `e (x) = x2 is at most

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-29 17:40:19
46Single-Pass List Partitioning Leonor Frias ∗ Universitat Polit`ecnica de Catalunya Dep. de Llenguatges i Sistemes Inform`atics Jordi Girona Salgado, Barcelona, Spain

Single-Pass List Partitioning Leonor Frias ∗ Universitat Polit`ecnica de Catalunya Dep. de Llenguatges i Sistemes Inform`atics Jordi Girona Salgado, Barcelona, Spain

Add to Reading List

Source URL: algo2.iti.kit.edu

Language: English - Date: 2008-05-15 11:50:35
47Comparison of Clustering Algorithms in the Context of Software Evolution Jingwei Wu, Ahmed E. Hassan, Richard C. Holt School of Computer Science University of Waterloo Waterloo ON, Canada j25wu,aeehassa,holt@uwaterloo.c

Comparison of Clustering Algorithms in the Context of Software Evolution Jingwei Wu, Ahmed E. Hassan, Richard C. Holt School of Computer Science University of Waterloo Waterloo ON, Canada j25wu,aeehassa,holt@uwaterloo.c

Add to Reading List

Source URL: plg.uwaterloo.ca

Language: English - Date: 2005-07-08 17:27:32
48Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis February 1, 2011 Problem Set 1

Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis February 1, 2011 Problem Set 1

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2011-02-07 15:14:45
49Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers Abstract The best randomized

Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers Abstract The best randomized

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:07:04